Maratones competidas/Maratón Nacional 2011/workspace/d/d.cpp

   1 // Equipo Poncho, Carriel y Ruana
   2 using namespace std;
   3 #include <algorithm>
   4 #include <iostream>
   5 #include <iterator>
   6 #include <sstream>
   7 #include <fstream>
   8 #include <cassert>
   9 #include <climits>
  10 #include <cstdlib>
  11 #include <cstring>
  12 #include <string>
  13 #include <cstdio>
  14 #include <vector>
  15 #include <cmath>
  16 #include <queue>
  17 #include <stack>
  18 #include <list>
  19 #include <map>
  20 #include <set>
  21
  22 template <class T> string toStr(const T &x)
  23 { stringstream s; s << x; return s.str(); }
  24 template <class T> int toInt(const T &x)
  25 { stringstream s; s << x; int r; s >> r; return r; }
  26
  27 #define For(i, a, b) for (int i=(a); i<(b); ++i)
  28 #define foreach(x, v) for (typeof (v).begin() x = (v).begin(); x != (v).end(); ++x)
  29 #define D(x) cout << #x " = " << (x) << endl;
  30
  31 const double EPS = 1e-9;
  32
  33 int cmp(double x, double y = 0, double tol = EPS) {
  34     return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
  35 }
  36
  37 #define INPUT_FILE "digital"
  38
  39 int main(){
  40     freopen(INPUT_FILE ".in", "r", stdin);
  41     int n, m;
  42     while (cin >> n >> m) {
  43         if (n == 0 and m == 0) break;
  44         int k; cin >> k;
  45         vector<long long> grad(k + 1);
  46         for (int i = 0; i < k + 1; ++i) {
  47             cin >> grad[i];
  48         }
  49         long long mod = n + 1;
  50         //assert(grad.size() == k + 1);
  51         set<long long> ans;
  52         for (long long x = 0; x <= m; x++){
  53             long long y = 0;
  54             long long d = 1;
  55             for (int i = 0; i < grad.size(); ++i) {
  56                 //printf("   y = y + %d\n", grad[i] * d);
  57                 y += ((grad[i] % mod) * d) % mod;
  58                 y %= mod;
  59                 d = (d * (x % mod)) % mod;
  60             }
  61             ans.insert(y % mod);
  62             //printf("added %d\n", y % mod);
  63         }
  64         cout << ans.size() << endl;
  65     }
  66     return 0;
  67
  68 }